String Pattern Matching Fora Deluge Survival
نویسنده
چکیده
String Pattern Matching concerns itself with algorithmic and combi-natorial issues related to matching and searching on linearly arranged sequences of symbols, arguably the simplest possible discrete structures. As unprecedented volumes of sequence data are amassed, disseminated and shared at an increasing pace, eeective access to, and manipulation of such data depend crucially on the eeciency with which strings are structured, compressed, transmitted, stored, searched and retrieved. This paper samples from this perspective, and with the authors' own bias, a rich arsenal of ideas and techniques developed in more than three decades of history. 1. INTRODUCTION This chapter reviews a number of rather ubiquitous primitives related to matching and searching with some elementary discrete structures such as strings, regular expressions, and other aggregates, that are likely to be of relevance, directly or indirectly, in the current and future infrastruc-tures of very large volumes of data. In that context, massive, scattered and diverse information repositories will pose increasing needs for novel approaches to their management by means of compression, inference, comparison and retrieval, mining, and related principles and techniques. Without pretending to be exhaustive, the selection of topics presented in this chapter was inspired by two main principles beside the authors' own bias. The rst one, was to recognize that the data ood is forcing a
منابع مشابه
String Matching and its Applications in Diversified Fields
String searching algorithms, sometimes called string matching algorithms, are an important class of string algorithms that try to find a place where one or several strings (also called patterns) are found within a larger string or text.[11] String matching is a classical problem in computer science. In this paper we are trying to explore the various diversified fields where string matching has ...
متن کاملTechniques Used in String Matching for Network Security
String matching also known as pattern matching is one of primary concept for network security. In this area the effectiveness and efficiency of string matching algorithms is important for applications in network security such as network intrusion detection, virus detection, signature matching and web content filtering system. This paper presents brief review on some of string matching technique...
متن کاملA Memory-Efficient Deterministic Finite Automaton-Based Bit-Split String Matching Scheme Using Pattern Uniqueness in Deep Packet Inspection
This paper proposes a memory-efficient bit-split string matching scheme for deep packet inspection (DPI). When the number of target patterns becomes large, the memory requirements of the string matching engine become a critical issue. The proposed string matching scheme reduces the memory requirements using the uniqueness of the target patterns in the deterministic finite automaton (DFA)-based ...
متن کاملAnalytic Approach to Pattern Matching
7.0 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 327 7.1 Probabilistic models . . . . . . . . . . . . . . . . . . . . . . . . . 330 7.2 Exact string matching . . . . . . . . . . . . . . . . . . . . . . . . 333 7.2.1 Languages representations . . . . . . . . . . . . . . . . . 334 7.2.2 Generating functions . . . . . . . . . . . . . . . . . . . . 337 7.2.3 Moments and li...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000